An Experimental Multiprocessor System for Distributed Parallel Computations
نویسندگان
چکیده
Leo De Maeye r (1927) obtained the Dr. Sc. degree in physical chemistry in 1954 at the University of Leuven, Belgium. Since 1965 he is scientific member of the MaxPlanck-Gesellschaft and director of the Department of Experimental Methods at the Max-Planck-lnstitute of Biophysical Chemistry in Goettingen. He is also teaching at the University of Leuven where he founded the Laboratory of Chemical and Biological Dynamics in 1970. From 1978 to 1981 he was head of the EMBL Instrumentation Division in Heidelberg. One of his main interests is the development and introduction of tools and techniques in the acquisition and evaluation of data in experimental natural sciences.
منابع مشابه
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling - Parallel Processing Symposium, 1998, and Symposium on Parallel and Distributed Processing 1998. 19
A real-time system must execute functionally correct computations in a timely mannel: In order to guarantee that all tasks accepted in the system will meet their timing requirements, an admission control algorithm must be used to only accept tasks whose requirements can be satisfied. Rate-monotonic scheduling (RMS) is arguably the best known scheduling policy for periodic real-time tasks on uni...
متن کاملAn efficient mapping of Boltzmann Machine computations onto distributed-memory multiprocessors
Oh, D.H., J.H. Nang, H. Yoon and S.R. Maeng, An efficient mapping of Boltzmann Machine computations onto distributedmemory multiprocessors, Microprocessing and Microprogramming 33 (1991/92) 223-236. In this paper, an efficient mapping scheme of Boltzmann Machine computations onto a distributed-memory multiprocessor, which exploits the synchronous spatial parallelism, is presented. In this schem...
متن کاملMultidimensional, Multiprocessor, Out-of-Core FFTs with Distributed Memory and Parallel Disks
We show how to compute multidimensional Fast Fourier Transforms (FFTs) on a multiprocessor system with distributed memory when problem sizes are so large that the data do not fit in the memory of the entire system. Instead, data reside on a parallel disk system and are brought into memory in sections. We use the Parallel Disk Model for implementation and analysis. Our method is a straightforwar...
متن کاملChapter 3 Chaos Arc : Real-time Objects and Atomicity for Multiprocessors 3.1 Reliability in Real-time Systems This Chapter Is Based on \chaos Arc : Kernel Support for Multi-weight Objects, Invocations, and Atomicity in Real-time Multiprocessor Applications,"
CHAOS arc is an object-based multiprocessor operating system kernel that provides primitives with which programmers may easily construct objects of diiering types and object invocations of diiering semantics, targeting multiprocessor systems and real-time applications. The CHAOS arc kernel can guarantee desired performance and functionality levels of selected computations in real-time applicati...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003